A natural-norm Successive Constraint Method for inf-sup lower bounds
نویسندگان
چکیده
منابع مشابه
A Natural–Norm Successive Constraint Method for Inf-Sup Lower Bounds
We present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the “linearized” inf-sup statement of the natural–norm approach with the approximation procedure of the Successive Constraint Method (SCM): the former (natura...
متن کاملAnalyse numérique/Numerical Analysis A Successive Constraint Linear Optimization Method for Lower Bounds of Parametric Coercivity and Inf-Sup Stability Constants
We present an approach to the construction of lower bounds for the coercivity and inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. The method, based on an Offline-Online strategy relevant in the reduced basis many-query and real-time context, reduces the Online calculation to a small Line...
متن کاملIntergenerational equity: sup, inf, lim sup, and lim inf
We study the problem of intergenerational equity for utility streams and a countable set of agents. A numerical social welfare function is invariant to ordinal transformation, satis es a weak monotonicity condition, and an invariance with respect to concatenation of utility streams if and only if it is either the sup, inf, lim sup, or lim inf.
متن کاملInf-sup Conditions
where u can be interpreted as the velocity field of an incompressible fluid motion, and p is then the associated pressure, the constant μ is the viscosity coefficient of the fluid. For simplicity, we consider homogenous Dirichlet boundary condition for the velocity, i.e. u|∂Ω = 0 and μ = 1. The conditions for the well posedness is known as inf-sup condition or Ladyzhenskaya-Babuška-Breezi (LBB)...
متن کاملSup - norm Estimates in Glimm ’ s Method *
We give a proof that Total Variation {a,,(.)} < 1 can be replaced by Sup{u,(.)} e 1 in Glimm's method whenever a coordinate system of Riemann invariants is present. The argument is somewhat simpler but in the same spirit as that given by Glimm in his celebrated paper of 1965. 0 1990 Academic Press, Inc. We consider the Cauchy problem u, + F(u), = 0, (1) 4-G 0) = u,(x), (2) where (1) denotes a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2010
ISSN: 0045-7825
DOI: 10.1016/j.cma.2010.02.011